Enumerative Questions on Rooted Weighted Necklaces
نویسندگان
چکیده
منابع مشابه
Enumerative Properties of Rooted Circuit Maps
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for s...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولOn T-codes and necklaces
This paper describes a newly discovered aspect of T-codes, a family of variable length codes first described by Titchener in the 1980s. We show that the constant-length subsets of codewords generated during the Tcode construction process constitute sets of necklaces. Moreover, we show that these sets are complete except for a small subset which we characterize. Bounds on the number of constant-...
متن کاملOn the Index of Necklaces
We consider the following two classes of simple graphs: open necklaces and closed necklaces, consisting of a finite number of cliques of fixed orders arranged in path-like pattern and cycle-like pattern, respectively. In these two classes we determine those graphs whose index (the largest eigenvalue of the adjacency matrix) is maximal.
متن کاملApplications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted automata, equations of ordinary generating functions and continued fractions. This new methodology is called Counting Automata Methodology. It...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1998
ISSN: 0196-8858
DOI: 10.1006/aama.1998.0603